11![Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset](https://www.pdfsearch.io/img/6efbf12b3aa05c245386e53ba4161776.jpg) | Add to Reading ListSource URL: tuvalu.santafe.eduLanguage: English - Date: 2013-11-23 11:09:17
|
---|
12![The scaling window for a random graph with a given degree sequence Hamed Hatami and Michael Molloy∗ Department of Computer Science University of Toronto e-mail: , The scaling window for a random graph with a given degree sequence Hamed Hatami and Michael Molloy∗ Department of Computer Science University of Toronto e-mail: ,](https://www.pdfsearch.io/img/95ade89666fd53c36dbc948bac0063bd.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2011-11-23 23:07:53
|
---|
13![Typical distances in a geometric model for complex networks ∗ Mohammed Amin Abdullah† Michel Bode‡ Typical distances in a geometric model for complex networks ∗ Mohammed Amin Abdullah† Michel Bode‡](https://www.pdfsearch.io/img/791f9e11af5a1301d6d6e1a61b6d06f5.jpg) | Add to Reading ListSource URL: web.mat.bham.ac.ukLanguage: English - Date: 2015-06-25 12:56:44
|
---|
14![SLS08_eurasip-revised.dvi SLS08_eurasip-revised.dvi](https://www.pdfsearch.io/img/765f8d0202e56412a6d7f8f4bf3682b6.jpg) | Add to Reading ListSource URL: pbil.univ-lyon1.frLanguage: English - Date: 2008-10-22 02:35:23
|
---|
15![Ephemeral Networks with Random Availability of Links: The case of fast networksI Eleni C. Akridaa,∗, Leszek Gąsienieca , George B. Mertziosb , Paul G. Spirakisa,c,d a Department of Computer Science, University of Liv Ephemeral Networks with Random Availability of Links: The case of fast networksI Eleni C. Akridaa,∗, Leszek Gąsienieca , George B. Mertziosb , Paul G. Spirakisa,c,d a Department of Computer Science, University of Liv](https://www.pdfsearch.io/img/868ee7d40f31ddc89fa1c168c7197ff7.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2015-10-21 12:18:19
|
---|
16![Sets that are connected in two random graphs Michael Molloy∗ August 17, 2012 Abstract We consider two random graphs G1 , G2 , both on the same vertex set. We ask whether there Sets that are connected in two random graphs Michael Molloy∗ August 17, 2012 Abstract We consider two random graphs G1 , G2 , both on the same vertex set. We ask whether there](https://www.pdfsearch.io/img/f769154fe7edf6767a43e382732c5b2c.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2012-08-17 11:21:38
|
---|
17![CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014 CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014](https://www.pdfsearch.io/img/7a4f8578e5a7745937341aff1c44d13c.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2015-01-04 19:18:44
|
---|
18![Diameter of random spanning trees in a given graph Fan Chung ∗ Diameter of random spanning trees in a given graph Fan Chung ∗](https://www.pdfsearch.io/img/82e0edce149235fd94b8426db5934457.jpg) | Add to Reading ListSource URL: web.cs.du.eduLanguage: English - Date: 2010-11-16 10:22:29
|
---|
19![C:/Research/Mixing/kcolourtree/RANDOM/wb-random.dvi C:/Research/Mixing/kcolourtree/RANDOM/wb-random.dvi](https://www.pdfsearch.io/img/46b8925b2e68cce97a6cbf0e3251ef1f.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2009-04-27 16:10:35
|
---|
20![Joint Parsing and Named Entity Recognition Jenny Rose Finkel and Christopher D. Manning Computer Science Department Stanford University Stanford, CA 94305 {jrfinkel|manning}@cs.stanford.edu Joint Parsing and Named Entity Recognition Jenny Rose Finkel and Christopher D. Manning Computer Science Department Stanford University Stanford, CA 94305 {jrfinkel|manning}@cs.stanford.edu](https://www.pdfsearch.io/img/5c10334245317c9dfe783e2e92f88bb6.jpg) | Add to Reading ListSource URL: nlp.stanford.eduLanguage: English - Date: 2009-05-24 04:21:01
|
---|